794B - Cutting Carrot - CodeForces Solution


geometry math *1200

Please click on ads to support us..

Python Code:

n,h=map(int,input().split())
for i in range(1,n):print(h*(i/n)**.5)
		 				 	 		 	  		 		  		

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
  long double n, h; cin >> n >> h;
  long double del = h/2.0/n;
  for(int i = 1; i < n; i++) {
    long double l = 0, r = h;
    int ct = 0;
    while(ct < 100) {
      long double x = (l+r)/2.0;
      long double b = x/h;
      if((b*x*0.5) < (del*i*1.0)) l = x;
      else r = x;
      ++ct;
    }
    cout << setprecision(20) << fixed << l << endl;
  }

  return 0;
}

			   		   			   				  	 		  		


Comments

Submit
0 Comments
More Questions

981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition
1609C - Complex Market Analysis
1657E - Star MST
1143B - Nirvana
1285A - Mezo Playing Zoma
919B - Perfect Number
894A - QAQ
1551A - Polycarp and Coins
313A - Ilya and Bank Account
1469A - Regular Bracket Sequence
919C - Seat Arrangements
1634A - Reverse and Concatenate
1619C - Wrong Addition